a heuristic approach for solving lip with the optional feasible or infeasible initial solution points

نویسندگان

yahia zare mehrjerdi department of industrial engineering, yazd university, yazd, iran,

چکیده

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for identifying a feasible solution point when an initial infeasible solution point is provided by the decision maker or when the searching process leaves the region of feasibility seeking for a better pattern to improve the objective function. instructions regarding the structure of such blp problems are broadly discussed. this added property offers a great degree of flexibility to the decision making problem solving process.the heuristic engine is comprised of four algorithms: improve, feasible, leave, and backtrack. in each iteration, when a selected algorithm has been terminated, the dm is presented with the results and asked to reevaluate the solution process by choosing an appropriate algorithm to follow. it is shown that the method converges to the optimal solution for most of the time. a solution technique for solving such a problem is introduced with sufficient details.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points

An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

Preventing aging with stem cell rejuvenation: Feasible or infeasible?

Characterized by dysfunction of tissues, organs, organ systems and the whole organism, aging results from the reduced function of effective stem cell populations. Recent advances in aging research have demonstrated that old tissue stem cells can be rejuvenated for the purpose of maintaining the old-organ function by youthful re-calibration of the environment where stem cells reside. Biochemical...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

a heuristic algorithm for nonlinear lexicography goal programming with an efficient initial solution

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis...

متن کامل

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of industrial engineering and productional research-

جلد ۲۳، شماره ۱، صفحات ۲۳-۳۳

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023